Log-Concavity and Symplectic Flows

نویسنده

  • YI LIN
چکیده

We prove the logarithmic concavity of the Duistermaat-Heckman measure of an Hamiltonian (n− 2)-dimensional torus action for which there exists an effective commuting symplectic action of a 2-torus with symplectic orbits. Using this, we show that any symplectic (n− 2)-torus action with non-empty fixed point set which satisfies this additional 2-torus condition must be Hamiltonian.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Log-concavity Conjecture for the Duistermaat-heckman Measure Revisited

Karshon constructed the first counterexample to the log-concavity conjecture for the Duistermaat-Heckman measure: a Hamiltonian six manifold whose fixed points set is the disjoint union of two copies of T. In this article, for any closed symplectic four manifold N with b > 1, we show that there is a Hamiltonian circle manifold M fibred over N such that its DuistermaatHeckman function is not log...

متن کامل

Brunn-minkowski Inequalities for Contingency Tables and Integer Flows

We establish approximate log-concavity for a wide family of combinatorially defined integer-valued functions. Examples include the number of non-negative integer matrices (contingency tables) with prescribed row and column sums (margins), as a function of the margins and the number of integer feasible flows in a network, as a function of the excesses at the vertices. As a corollary, we obtain a...

متن کامل

Strong log-concavity is preserved by convolution

We review and formulate results concerning strong-log-concavity in both discrete and continuous settings. Although four different proofs of preservation of strong log-concavity are known in the discrete setting (where strong log-concavity is known as “ultra-log-concavity”), preservation of strong log-concavity under convolution has apparently not been investigated previously in the continuous c...

متن کامل

Combinatorial conjectures that imply local log-concavity of graph genus polynomials

The 25-year old LCGD Conjecture is that the genus distribution of every graph is log-concave. We present herein a new topological conjecture, called the Local Log-Concavity Conjecture. We also present a purely combinatorial conjecture, which we prove to be equivalent to the Local Log-Concavity Conjecture. We use the equivalence to prove the Local Log-Concavity Conjecture for graphs of maximum d...

متن کامل

A strong log-concavity property for measures on Boolean algebras

We introduce the antipodal pairs property for probability measures on finite Boolean algebras and prove that conditional versions imply strong forms of log-concavity. We give several applications of this fact, including improvements of some results of Wagner [15]; a new proof of a theorem of Liggett [9] stating that ultra-log-concavity of sequences is preserved by convolutions; and some progres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012